Open Petri Nets: Non-deterministic Processes and Compositionality
نویسندگان
چکیده
We introduce ranked open nets, a reactive extension of Petri nets which generalises a basic open net model introduced in a previous work by allowing for a refined notion of interface. The interface towards the external environment of a ranked open net is given by a subset of places designated as open and used for composition. Additionally, a bound on the number of connections which are allowed on an open place can be specified. We show that the non-deterministic process semantics is compositional with respect to the composition operation over ranked open nets, a result which did not hold for basic open nets.
منابع مشابه
Compositional semantics for open Petri nets based on deterministic processe
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designated as open, represent an interface of the system towards the environment. Besides generalizing the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisi...
متن کاملWadge Degrees of $\omega$-Languages of Petri Nets
We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective...
متن کاملCompositional semantics for open Petri nets based on deterministic processes †
Compositional semantics for open Petri nets based on deterministic processes† PAOLO BALDAN‡, ANDREA CORRADINI§, HARTMUT EHRIG¶ and REIKO HECKEL‖ ‡Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy §Dipartimento di Informatica, Università di Pisa, Italy ¶Computer Science Department, Technical University of Berlin, Germany ‖Dept. of Math. and Comp. Science, University of Paderb...
متن کاملEvolving Concurrent Petri Net Models of Epistasis
A genetic algorithm is used to learn a non-deterministic Petri netbased model of non-linear gene interactions, or statistical epistasis. Petri nets are computational models of concurrent processes. However, often certain global assumptions (e.g. transition priorities) are required in order to convert a non-deterministic Petri net into a simpler deterministic model for easier analysis and evalua...
متن کاملOn the Topological Complexity of omega-Languages of Non-Deterministic Petri Nets
We show that there are Σ 3 -complete languages of infinite words accepted by non-deterministic Petri nets with Büchi acceptance condition, or equivalently by Büchi blind counter automata. This shows that ω-languages accepted by non-deterministic Petri nets are topologically more complex than those accepted by deterministic Petri nets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008